Non-factorizable C-valued functions induced by finite connected graphs
نویسندگان
چکیده
منابع مشابه
Analysis of non-connected piled raft foundations (NCPRF) with cushion by finite element method
For the optimum design of Piled Raft Foundations (PRF), the concept of settlement reducer piles has been applied. However, when these piles are connected to the raft, a high stress may develop in the relatively small number of piles. Therefore, an alternative approach is to disconnect the piles from the raft forming a new system called a non-connected or disconnected piled-raft foundation (NCPR...
متن کاملC-Planarity of C-Connected Clustered Graphs
We present the first characterization of c-planarity for c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchies of the triconnected and biconnected components of the underlying graph. Based on such a characterization, we provide a linear-time c-planarity testing and embedding algorithm for c-connected clustered grap...
متن کاملGeneralized Ritt type and generalized Ritt weak type connected growth properties of entire functions represented by vector valued Dirichlet series
In this paper, we introduce the idea of generalized Ritt type and generalised Ritt weak type of entire functions represented by a vector valued Dirichlet series. Hence, we study some growth properties of two entire functions represented by a vector valued Dirichlet series on the basis of generalized Ritt type and generalised Ritt weak type.
متن کاملFinite rank harmonic operator-valued functions
The purpose of this paper is to characterize when a harmonic function with values in the finite rank operators on a Hilbert space is expressible as a harmonic matrix-valued function. We show that harmonic function with values in the rank 1 normal operators is expressible as a harmonic matrix-valued function. We also prove that for any natural number, n, a harmonic function with values in the ra...
متن کاملOn the complexity of finite valued functions
The essential variables in a finite function f are defined as variables which occur in f and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When replacing some variables in a function with constants the resulting functions are called subfunctions, and when replacing all essential variables in a function wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2017
ISSN: 1232-9274
DOI: 10.7494/opmath.2017.37.2.225